Large sets of t-designs through partitionable sets: A survey

Large sets of t-designs through partitionable sets: A survey

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

Large sets of t-designs through partitionable sets, a review

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

New t-designs and large sets of t-designs

Some small large sets of t-designs

Large sets of disjoint t-designs

[u this paper, we show how the basis reduction algorithm of Kreher and Radziszowski can be used to construct large sets of disjoint designs with specified automorphisms. In particular, we construct a (3,4,23;4)large set which rise to an infinite family of large sets of 4-desiglls via a result of Teirlinck [6].